Is there a built in Mathematica function I can use to compare unequally dimensioned lists?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
3
down vote

favorite












This is a higher level question, and I don't expect a full answer, but maybe a nudge in the right direction would help, or maybe there is a built in Mathematica function that does something very similar to this already.



I have a list A of lists. The lists in A are of different length, and can even have different levels. One example of these is, using TreeForm:
enter image description here



Another example would be:
enter image description here



So there are obviously a lot of differences between them.



I have written a function which extracts the elements at each level, so that I can then compare the lists level by level. However, I wonder - is there a built in function in Mathematica that does something similar to this, and generates a number representing how far apart they are? I have looked, but not found anything yet that works on lists of different dimensions.



Or even, could there be a way to convert these to graphs, and then, maybe there would be a built in function that compares the similarity of graphs?



Any hints on the best way to find the similarity between any two of the lists in list A would be very appreciated! Again, I don't expect any hand-outs, but a point in the right direction would be great!



Thanks!






list-manipulation function-comparison distance nearest







share|improve this question

























    up vote
    3
    down vote

    favorite












    This is a higher level question, and I don't expect a full answer, but maybe a nudge in the right direction would help, or maybe there is a built in Mathematica function that does something very similar to this already.



    I have a list A of lists. The lists in A are of different length, and can even have different levels. One example of these is, using TreeForm:
    enter image description here



    Another example would be:
    enter image description here



    So there are obviously a lot of differences between them.



    I have written a function which extracts the elements at each level, so that I can then compare the lists level by level. However, I wonder - is there a built in function in Mathematica that does something similar to this, and generates a number representing how far apart they are? I have looked, but not found anything yet that works on lists of different dimensions.



    Or even, could there be a way to convert these to graphs, and then, maybe there would be a built in function that compares the similarity of graphs?



    Any hints on the best way to find the similarity between any two of the lists in list A would be very appreciated! Again, I don't expect any hand-outs, but a point in the right direction would be great!



    Thanks!






    list-manipulation function-comparison distance nearest







    share|improve this question























      up vote
      3
      down vote

      favorite









      up vote
      3
      down vote

      favorite











      This is a higher level question, and I don't expect a full answer, but maybe a nudge in the right direction would help, or maybe there is a built in Mathematica function that does something very similar to this already.



      I have a list A of lists. The lists in A are of different length, and can even have different levels. One example of these is, using TreeForm:
      enter image description here



      Another example would be:
      enter image description here



      So there are obviously a lot of differences between them.



      I have written a function which extracts the elements at each level, so that I can then compare the lists level by level. However, I wonder - is there a built in function in Mathematica that does something similar to this, and generates a number representing how far apart they are? I have looked, but not found anything yet that works on lists of different dimensions.



      Or even, could there be a way to convert these to graphs, and then, maybe there would be a built in function that compares the similarity of graphs?



      Any hints on the best way to find the similarity between any two of the lists in list A would be very appreciated! Again, I don't expect any hand-outs, but a point in the right direction would be great!



      Thanks!






      list-manipulation function-comparison distance nearest







      share|improve this question













      This is a higher level question, and I don't expect a full answer, but maybe a nudge in the right direction would help, or maybe there is a built in Mathematica function that does something very similar to this already.



      I have a list A of lists. The lists in A are of different length, and can even have different levels. One example of these is, using TreeForm:
      enter image description here



      Another example would be:
      enter image description here



      So there are obviously a lot of differences between them.



      I have written a function which extracts the elements at each level, so that I can then compare the lists level by level. However, I wonder - is there a built in function in Mathematica that does something similar to this, and generates a number representing how far apart they are? I have looked, but not found anything yet that works on lists of different dimensions.



      Or even, could there be a way to convert these to graphs, and then, maybe there would be a built in function that compares the similarity of graphs?



      Any hints on the best way to find the similarity between any two of the lists in list A would be very appreciated! Again, I don't expect any hand-outs, but a point in the right direction would be great!



      Thanks!






      list-manipulation function-comparison distance nearest




      list-manipulation function-comparison distance nearest






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 3 hours ago









      Jmeeks29ig

      48428




      48428




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          One approach is with Level. If your expression is called struct,



          Level[struct, 0, Infinity]


          or perhaps



          Level[struct, 0, Infinity, Heads -> True]


          or even



          Level[struct, #] & /@ Range[Depth[struct]]


          You can also pick individual levels at will. As for measuring how far apart the levels are, you could do something as simple as length, or some function of length and depth. Crudely, this might be similar to 



          LeafCount[struct]





          share|improve this answer






















          • Great, thanks, I will give that a go!
            – Jmeeks29ig
            6 mins ago

















          up vote
          1
          down vote













          There's no unique measure, so I would use GraphPropertyDistribution on as many graph properties as you can imagine.






          share|improve this answer




















          • Alright, thanks, I'll look into that!
            – Jmeeks29ig
            5 mins ago










          Your Answer




          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "387"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          convertImagesToLinks: false,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f182274%2fis-there-a-built-in-mathematica-function-i-can-use-to-compare-unequally-dimensio%23new-answer', 'question_page');

          );

          Post as a guest

















          2 Answers
          2






          active

          oldest

          votes








          2 Answers
          2






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          3
          down vote



          accepted










          One approach is with Level. If your expression is called struct,



          Level[struct, 0, Infinity]


          or perhaps



          Level[struct, 0, Infinity, Heads -> True]


          or even



          Level[struct, #] & /@ Range[Depth[struct]]


          You can also pick individual levels at will. As for measuring how far apart the levels are, you could do something as simple as length, or some function of length and depth. Crudely, this might be similar to 



          LeafCount[struct]





          share|improve this answer






















          • Great, thanks, I will give that a go!
            – Jmeeks29ig
            6 mins ago














          up vote
          3
          down vote



          accepted










          One approach is with Level. If your expression is called struct,



          Level[struct, 0, Infinity]


          or perhaps



          Level[struct, 0, Infinity, Heads -> True]


          or even



          Level[struct, #] & /@ Range[Depth[struct]]


          You can also pick individual levels at will. As for measuring how far apart the levels are, you could do something as simple as length, or some function of length and depth. Crudely, this might be similar to 



          LeafCount[struct]





          share|improve this answer






















          • Great, thanks, I will give that a go!
            – Jmeeks29ig
            6 mins ago












          up vote
          3
          down vote



          accepted







          up vote
          3
          down vote



          accepted






          One approach is with Level. If your expression is called struct,



          Level[struct, 0, Infinity]


          or perhaps



          Level[struct, 0, Infinity, Heads -> True]


          or even



          Level[struct, #] & /@ Range[Depth[struct]]


          You can also pick individual levels at will. As for measuring how far apart the levels are, you could do something as simple as length, or some function of length and depth. Crudely, this might be similar to 



          LeafCount[struct]





          share|improve this answer














          One approach is with Level. If your expression is called struct,



          Level[struct, 0, Infinity]


          or perhaps



          Level[struct, 0, Infinity, Heads -> True]


          or even



          Level[struct, #] & /@ Range[Depth[struct]]


          You can also pick individual levels at will. As for measuring how far apart the levels are, you could do something as simple as length, or some function of length and depth. Crudely, this might be similar to 



          LeafCount[struct]






          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited 58 mins ago

























          answered 2 hours ago









          bill s

          51.1k373145




          51.1k373145











          • Great, thanks, I will give that a go!
            – Jmeeks29ig
            6 mins ago
















          • Great, thanks, I will give that a go!
            – Jmeeks29ig
            6 mins ago















          Great, thanks, I will give that a go!
          – Jmeeks29ig
          6 mins ago




          Great, thanks, I will give that a go!
          – Jmeeks29ig
          6 mins ago










          up vote
          1
          down vote













          There's no unique measure, so I would use GraphPropertyDistribution on as many graph properties as you can imagine.






          share|improve this answer




















          • Alright, thanks, I'll look into that!
            – Jmeeks29ig
            5 mins ago














          up vote
          1
          down vote













          There's no unique measure, so I would use GraphPropertyDistribution on as many graph properties as you can imagine.






          share|improve this answer




















          • Alright, thanks, I'll look into that!
            – Jmeeks29ig
            5 mins ago












          up vote
          1
          down vote










          up vote
          1
          down vote









          There's no unique measure, so I would use GraphPropertyDistribution on as many graph properties as you can imagine.






          share|improve this answer












          There's no unique measure, so I would use GraphPropertyDistribution on as many graph properties as you can imagine.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 1 hour ago









          David G. Stork

          21.5k11646




          21.5k11646











          • Alright, thanks, I'll look into that!
            – Jmeeks29ig
            5 mins ago
















          • Alright, thanks, I'll look into that!
            – Jmeeks29ig
            5 mins ago















          Alright, thanks, I'll look into that!
          – Jmeeks29ig
          5 mins ago




          Alright, thanks, I'll look into that!
          – Jmeeks29ig
          5 mins ago

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f182274%2fis-there-a-built-in-mathematica-function-i-can-use-to-compare-unequally-dimensio%23new-answer', 'question_page');

          );

          Post as a guest
































































          Comments

          Post a Comment

          Popular posts from this blog

          Long meetings (6-7 hours a day): Being “babysat” by supervisor

          Image
          Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 31 down vote favorite 4 I hold a PhD in mechanical engineering with a 7 year background in self-guided, self-paced research including 2 years as a graduate level course instructor and a subject matter expert for various engineering projects in a university setting in the United States. For the last 10-11 months, I am working in a research industry in France where my task is to debug C++ spaghetti code written over a period of several years by my current supervisor. It is a team of 2: just I and my supervisor. Diurnally, I am posed with a "bug of the day" to get out of this C++ code. My supervisor generally gives me about 15-30 minutes to solve it and then accosts me about whether or not the task is completed and then rinses and repeats this until the end of the day. Off-late, my supervisor has been holding 6-7 hour long "meetin
          Read more

          Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

          Image
          Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite Many fantasy worlds have multiple humanoid species (elves, orcs, humans, etc) living in the same world, in addition to that, they often have the ability to interbreed. And I can't help but question their believability... fantasy-races reproduction interspecies-relations share | improve this question edited Aug 9 at 14:46 Michael Kjörling ♦ 21.1k 10 85 161 asked Aug 9 at 13:13 Chlodio 118 6 closed as unclear what you're asking by MichaelK, Gryphon, John, Vincent, Frostfyre Aug 9 at 15:25 Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question. 3 Stack Exchange exist to
          Read more

          Confectionery

          Image
          Prepared foods made with a lot of sugar or other cabohydrates "Sweetmeat" redirects here. For the racehorse, see Sweetmeat (horse). Not to be confused with Sweetbread. This Kransekake is a traditional Scandinavian baker's confection. Confectionery is the art of making confections , which are food items that are rich in sugar and carbohydrates. Exact definitions are difficult. [1] In general, though, confectionery is divided into two broad and somewhat overlapping categories, bakers' confections and sugar confections. [2] Bakers' confectionery, also called flour confections , includes principally sweet pastries, cakes, and similar baked goods. Sugar confectionery includes candies ( sweets in British English), candied nuts, chocolates, chewing gum, bubble gum, pastillage, and other confections that are made primarily of sugar. In some cases, chocolate confections (confections made of chocolate) are treated as a separate category, as are sugar-free versions of
          Read more