New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Re-implement NLTK tree #11

Open

andreasvc opened this issue Dec 18, 2012 · 0 comments

Labels

Owner

andreasvc commented Dec 18, 2012

Would allow a potentially significant speedup for treebank transformations and grammar extraction.

Wishlist:

represent all treebank information: functions, morphology, lemmas, &c.
combine indices and words in one datastructure
parent pointers, sibling pointers
store yield of each node, i.e., tree.leaves(). modification of tree triggers update in all ancestors.
automatic canonicalization
mutable and immutable versions. immutable version could use C arrays/structs.
perhaps specific optimized version for binary trees.

andreasvc added the efficiency label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment