We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
Text Distance
Compute the Levenshtein distance between two fragments of text.
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Text A | A | First text fragment | Text |
| Text B | B | Second text fragment | Text |
| Case | C | Compare using case-sensitive matching | Boolean |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Distance | D | Levenshtein distance between the two fragments | Integer |
Site design © Robin Rodricks.
Grasshopper Sets and associated data © 2024 Robert McNeel & Associates.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub