Skip to content

A graph edit distance algorithm which determines the difference between two sentences based on semantic content and syntactical structure. Sentences are represented as dependency graphs.

Notifications You must be signed in to change notification settings

haakondr/nlp-graph-edit-distance-depricated

Repository files navigation

nlp-graph-edit-distance

A thesis project focusing on the usage of dependency graphs as a representation of natural language text. Sentences are represented as graph structures, tagged with part-of-speech tags and relations between words. This representation is used as a measure of similarity between two sentences.

Below is an example of how the the edit operations between the two sentences:

  • Mary was kissed by Bob
  • Bob kissed Mary

My image

Dependencies

  • java7
  • maven

Quick start

From the command line in the project root directory:

mvn install
mvn exec:java

Enter two sentences, and the graph edit distance will be printed

About

A graph edit distance algorithm which determines the difference between two sentences based on semantic content and syntactical structure. Sentences are represented as dependency graphs.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages