https://github.com/mwotton/treeish

https://github.com/mwotton/treeish

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/mwotton/treeish
• Owner: mwotton
• License: bsd-3-clause
• Created: 2022-03-25T06:40:32.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2022-03-25T06:40:43.000Z (almost 3 years ago)
• Last Synced: 2024-10-27T18:27:53.938Z (3 months ago)
• Language: Haskell
• Homepage:
• Size: 5.86 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# treeish

`treeish` is a package for comparing two treelike structures and getting a normalised

comparison between them. The comparison is intended to be somewhat rough, to get a

qualitative judgment: changed spelling or an added sentence in a text field should

not trigger an alarm, but a missing node ought to be flagged.

Also need to be able to take a set of diffs and collapse them into a single diff.

This lets us take a set of rows with a key field and compare two whole datasets.

## questions

- does level in the tree matter when it comes to weighting differences?

  For my purposes, my trees are not deep so it doesn't matter much, but it'd

  be nice to have a principled answer. For the moment, I'll flatten it out.