Hacker News new | comments | show | ask | jobs | submit login
Show HN: Natural Language Earley Parser Algorithm in Python (github.com)
14 points by amirouche on Mar 17, 2017 | hide | past | web | favorite | 4 comments

Hi, I also wrote an Earley parser in Python that creates parse-forests for ambiguity.

Just in case you're interested in seeing another implementation: https://github.com/erezsh/lark/blob/master/lark/parsers/earl...

indeed you project seems better I will add a direct link to you project!


Is Earley's algorithm fruitfully used for any particular natural language and task?

If you have a grammar, it output parse trees of dependency relations and POS tags. I write trees because it also handles ambiguities during the parse. A sentence, can lead to several parse trees. Give me a sentence that has two meaning in english I will try to build an example in english that displays the properties of the output of the program.

I am wondering how to construct the grammar automatically.

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact