NLP2020
- 54 שאלות
- -- תגובות
- 0% הושלמו
- equalizer סטטיסטיקות
- share שתף
Discuss, Learn and be Happy דיון בשאלות
help
brightness_4
brightness_7
format_textdirection_r_to_l
format_textdirection_l_to_r
Provide the formal definition of a CFG: A CFG is defined by a 4-tuple (NT, T, S, R) where:
1
| done | ||
מיין לפי
When generating random sequences according to a CFG, what are the 2 primitive computational operations that must be used to implement the semantics of the CFG?
1
| done | ||
מיין לפי
What are the possible forms of rules for a CFG in Chomsky Normal Form (CNF)?
1
| done | ||
מיין לפי
What is the complexity of parsing a sentence of n words according to a CFG grammar in CNF using the CKY algorithm?
1
| done | ||
מיין לפי