您好,欢迎访问三七文档
当前位置:首页 > 法律文献 > 理论/案例 > Parsing Natural Languages
IntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingNaturalLanguagesNitinGuptaundertheguidanceofProf.PushpakBhattacharyaDepartmentofComputerScienceandEngg,IITBombayApril17,2005NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPIntroductionIParsingisafunctionthat,givenanaturallanguagestringasinput,outputsadescriptionofitsconstituentstructure.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPIntroductionIParsingisafunctionthat,givenanaturallanguagestringasinput,outputsadescriptionofitsconstituentstructure.IParsingisthetaskofidentifyingphrasesofasentenceanddescribingthesyntacticrelationsamongthem.SVPADJNPNVflyingplanesaretheypronNPBDCEFNitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPIntroductionIParsingisafunctionthat,givenanaturallanguagestringasinput,outputsadescriptionofitsconstituentstructure.IParsingisthetaskofidentifyingphrasesofasentenceanddescribingthesyntacticrelationsamongthem.SVPADJNPNVflyingplanesaretheypronNPBDCEFIMostcommonuseofparsersistoparsecomputerprogramminglanguages.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPIntroductionIParsingisafunctionthat,givenanaturallanguagestringasinput,outputsadescriptionofitsconstituentstructure.IParsingisthetaskofidentifyingphrasesofasentenceanddescribingthesyntacticrelationsamongthem.SVPADJNPNVflyingplanesaretheypronNPBDCEFIMostcommonuseofparsersistoparsecomputerprogramminglanguages.IStatisticalNLP:determinehowtomodelthelanguagebyderivingprobabilityestimatesforunseenevents.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPCentralProblemsIGrammaticalagreement:ensurethatparseracceptsasgrammaticalonlyagreement-legalstrings,andrejectsthoseinwhichagreementfails.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPCentralProblemsIGrammaticalagreement:ensurethatparseracceptsasgrammaticalonlyagreement-legalstrings,andrejectsthoseinwhichagreementfails.IAmbiguity:It’swellknownthatsomeEnglishsentencesareambiguous.SVPADJNPNVflyingplanesaretheypronNPSVPpronNPAUXVNtheyflyingplanesareNitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPCentralProblemsIGrammaticalagreement:ensurethatparseracceptsasgrammaticalonlyagreement-legalstrings,andrejectsthoseinwhichagreementfails.IAmbiguity:It’swellknownthatsomeEnglishsentencesareambiguous.SVPADJNPNVflyingplanesaretheypronNPSVPpronNPAUXVNtheyflyingplanesareIClassificationintogrammaticalandungrammatical.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPCentralProblemsIGrammaticalagreement:ensurethatparseracceptsasgrammaticalonlyagreement-legalstrings,andrejectsthoseinwhichagreementfails.IAmbiguity:It’swellknownthatsomeEnglishsentencesareambiguous.SVPADJNPNVflyingplanesaretheypronNPSVPpronNPAUXVNtheyflyingplanesareIClassificationintogrammaticalandungrammatical.IThestructureanduseoflanguagealsochangesovertime.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionParsingProblemsinNLPIntroductionParsingProblemsinNLPDeterministicParsingChomskyHierarchyBasicAlgorithmsChartParserProbabilisticParsingProbabilisticCFGHiddenMarkovModelsOtherConceptsCharniak’sFirstParserProbabilisitcChartParserEntropyInspiredParsingDependencyGrammarIntroductionAdvantagesASimpleAlgorithmConclusionNitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionChomskyHierarchyBasicAlgorithmsChartParserChomskyHierarchyIContainmenthierarchyofclassesofformalgrammarsthatgenerateformallanguages.1.RegularLanguages2.Context-freeGrammar3.Context-sensitiveGrammar4.PhrasestructureGrammarNitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionChomskyHierarchyBasicAlgorithmsChartParserChomskyHierarchyIContainmenthierarchyofclassesofformalgrammarsthatgenerateformallanguages.1.RegularLanguages2.Context-freeGrammar3.Context-sensitiveGrammar4.PhrasestructureGrammarIThisdiscussionassumesthatnaturallanguagesasaclassarecontextfree,thatis,capableofbeinggeneratedbycontextfreegrammars.NitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionChomskyHierarchyBasicAlgorithmsChartParserBasicAlgorithmsIBottomupparsingNitinGuptaParsingNaturalLanguagesIntroductionDeterministicParsingProbabilisticParsingDependencyGrammarConclusionChomskyHierarchyBasicAlgorithmsChartParserBasicAlgorithmsIBottomupparsingITopdo
本文标题:Parsing Natural Languages
链接地址:https://www.777doc.com/doc-4484815 .html