https://github.com/annoraaq/exted

Tree edit distance algorithm in elixir
https://github.com/annoraaq/exted

Last synced: 1 day ago
JSON representation

Tree edit distance algorithm in elixir

• Host: GitHub
• URL: https://github.com/annoraaq/exted
• Owner: Annoraaq
• Created: 2018-01-27T22:49:14.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2020-12-29T17:17:32.000Z (almost 4 years ago)
• Last Synced: 2024-11-04T18:24:16.296Z (about 2 months ago)
• Language: Elixir
• Size: 6.84 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Funding: .github/FUNDING.yml

Awesome Lists containing this project

README

        
# ExTed

ExTed is a naive implementation of a tree edit distance algorithm in Elixir. Please note that this algorithm has exponential runtime complexity!

Trees consist of a label and children: ```{:label, [], [child_1, ..., child_n]}```

The second value in the tuple is not used yet and only existent to be compatible with Elixir syntax trees.

Forests are lists of trees.

## Usage

```Ted.ted(forest_1, forest_2)```