Constituency Trees: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 11: | Line 11: | ||
Grammars, generally, are a way of describing a potentially infinite set of strings (sentences) using a finite set of production rules. TODO snad zitra... | Grammars, generally, are a way of describing a potentially infinite set of strings (sentences) using a finite set of production rules. TODO snad zitra... | ||
== Syntax in Machine Translation == | |||
== Synchronous Grammars for Translation == | |||
=== Translating with SCFG === | |||
=== Synchronous Grammar Extraction === | |||
Revision as of 09:29, 6 August 2015
 | |
| Lecture video: |
web TODO Youtube |
|---|---|
{{#ev:youtube|https://www.youtube.com/watch?v=y_9SEdG1u3U%7C800%7Ccenter}}
Context Free Grammar
Grammars, generally, are a way of describing a potentially infinite set of strings (sentences) using a finite set of production rules. TODO snad zitra...