I use CYK algorithm (already implemented it in Java) to see if a string recognized according to a specific grammar. Now I need to generate a parse tree for the string, is the a way to generate the tree from the matrix which I use when using the CYK algorithm?
Generating parse tree from CYK algorithm
2.7k Views Asked by Lucy At
1
There are 1 best solutions below
Related Questions in PARSING
- How to resize images with PHP PARSE SDK
- Constraint not propagated upon instantiation of list members
- How can I parse fixed-length, non-delimited integers with attoparsec?
- jSon result optional value error
- Date parse with Timezone - Android
- URL Variable is not being recognized using NSURL
- Regex to get vCard base64 string (C#)
- Retrieving string value from label and then parsing into an integer, pyqt4
- How to use Papa Parse for javascript csv parsing
- How to parse/split a string?
- String concatenation with padded integers
- Is this file an XML or HTML file? How can I parse it?
- json parser to spinner
- Use DateTime format in a class but restrict time tokens
- Saving multiple occurrences of strstr() from a line in C?
Related Questions in CONTEXT-FREE-GRAMMAR
- Strings from grammar
- Grammar: Precedence of grammar alternatives
- Context Free Grammar BNF
- Xtext grammar describing cron expression not working as expected
- can removing left recursion introduce ambiguity?
- How to match with a expression grammar only the last time a keyword occurs occurs
- This LL(1) parse table is correct?
- syntax-directed definition to determine the type of expression
- Nullable nonterminals
- Is ε terminal in context-free?
- CFG to Regular expression
- How to fix shift-reduce conflict in this grammar
- How to deal with some ambiguous context free grammar productions in Python
- writing a parser in prolog
- How to Generate and display ParseTree for an expression in C# using Irony?
Related Questions in PARSE-TREE
- using antlr4 C# grammar in java
- How can I easily draw a parse tree from Stanford parsing data in python?
- Chomsky-normal-form grammar extraction from a parse tree
- Syntax directed definition (count number of pairs of parentheses)
- Parse tree parenthesis notation
- What does the tag SBAR mean in Stanford’s parse-tree representation?
- How to get IParseTree in ANTLR4?
- Why do I get UnsupportedOperationException with Stanford CoreNLP
- No head rule defined for AP when parsing a sentence using Stanford CoreNLP
- Tool for drawing parse trees?
- What's the difference between parse trees and abstract syntax trees (ASTs)?
- wrong expression type on ocamlyacc
- How to print a proper parse tree in console using Java?
- Decorating parse tree using attribute grammar
- Grammar Parse tree?
Related Questions in CYK
- NLTK tell if word is generated by CFG
- Is this CYK parser result correct?
- Cocke Younger Kasami (CYK) algorithm and computer vision
- CYK algorithm top down design with memoization
- Does CKY really require CNF?
- How to implement CYK parsing algorithm in Ruby?
- CYK (Cocke-Younger-Kasami) Grammar Rules
- Generating parse tree from CYK algorithm
- CYK algorithm implementation C++
- Python list to Parse tree
- Extract probabilities and most likely parse tree from cyk
- CYK algorithm implementation java
- What is the difference between Viterbi CYK and Probabilistic CYK algorithm, Is there any differences?
- Product of 2 Lists in ocaml without Imperative Functions
- How does the CYK algorithm work?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
When implementing CYK as just a recognizer, then the boxes in the chart are generally just a set of bits (or other boolean values) that correspond to the productions that might apply at that point. That doesn't leave you enough information to reconstruct the parse tree.
If you instead store a set of objects, those objects include the non-terminal and keep track of the two productions that were combined. When you're done, you check if your final box contains an object which represents a start symbol production. If it does, you can follow the pointers back to reconstruct the parse tree.