All Downloads are FREE. Search and download functionalities are using the official Maven repository.

simplenlg.morphology.english.MorphologyProcessor Maven / Gradle / Ivy

The newest version!
/*
 * The contents of this file are subject to the Mozilla Public License
 * Version 2.0 (the "License"); you may not use this file except in
 * compliance with the License. You may obtain a copy of the License at
 * https://www.mozilla.org/en-US/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS"
 * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
 * License for the specific language governing rights and limitations
 * under the License.
 *
 * The Original Code is "Simplenlg".
 *
 * The Initial Developer of the Original Code is Ehud Reiter, Albert Gatt and Dave Westwater.
 * Portions created by Ehud Reiter, Albert Gatt and Dave Westwater are Copyright (C) 2010-11 The University of Aberdeen. All Rights Reserved.
 *
 * Contributor(s): Ehud Reiter, Albert Gatt, Dave Westwater, Roman Kutlak, Margaret Mitchell, and Saad Mahamood.
 */
package simplenlg.morphology.english;

import java.util.ArrayList;
import java.util.List;

import simplenlg.features.DiscourseFunction;
import simplenlg.features.Feature;
import simplenlg.features.InternalFeature;
import simplenlg.framework.*;

/**
 * 

* This is the processor for handling morphology within the SimpleNLG. The * processor inflects words form the base form depending on the features applied * to the word. For example, kiss is inflected to kissed for * past tense, dog is inflected to dogs for pluralisation. *

* *

* As a matter of course, the processor will first use any user-defined * inflection for the world. If no inflection is provided then the lexicon, if * it exists, will be examined for the correct inflection. Failing this a set of * very basic rules will be examined to inflect the word. *

* *

* All processing modules perform realisation on a tree of * NLGElements. The modules can alter the tree in whichever way * they wish. For example, the syntax processor replaces phrase elements with * list elements consisting of inflected words while the morphology processor * replaces inflected words with string elements. *

* *

* N.B. the use of module, processing module and * processor is interchangeable. They all mean an instance of this * class. *

* * @author D. Westwater, University of Aberdeen. * @version 4.0 */ public class MorphologyProcessor extends NLGModule { @Override public void initialise() { // Do nothing } @Override public NLGElement realise(NLGElement element) { NLGElement realisedElement = null; if(element instanceof InflectedWordElement) { realisedElement = doMorphology((InflectedWordElement) element); } else if(element instanceof StringElement) { realisedElement = element; } else if(element instanceof WordElement) { // AG: now retrieves the default spelling variant, not the baseform // String baseForm = ((WordElement) element).getBaseForm(); String defaultSpell = ((WordElement) element).getDefaultSpellingVariant(); if(defaultSpell != null) { realisedElement = new StringElement(defaultSpell); } } else if(element instanceof DocumentElement) { List children = element.getChildren(); ((DocumentElement) element).setComponents(realise(children)); realisedElement = element; } else if(element instanceof ListElement) { realisedElement = new ListElement(); ((ListElement) realisedElement).addComponents(realise(element.getChildren())); } else if(element instanceof CoordinatedPhraseElement) { List children = element.getChildren(); ((CoordinatedPhraseElement) element).clearCoordinates(); if(children != null && children.size() > 0) { ((CoordinatedPhraseElement) element).addCoordinate(realise(children.get(0))); for(int index = 1; index < children.size(); index++) { ((CoordinatedPhraseElement) element).addCoordinate(realise(children.get(index))); } realisedElement = element; } } else if(element != null) { realisedElement = element; } return realisedElement; } /** * This is the main method for performing the morphology. It effectively * examines the lexical category of the element and calls the relevant set * of rules from MorphologyRules. * * @param element the InflectedWordElement * @return an NLGElement reflecting the correct inflection for * the word. */ private NLGElement doMorphology(InflectedWordElement element) { NLGElement realisedElement = null; if(element.getFeatureAsBoolean(InternalFeature.NON_MORPH).booleanValue()) { realisedElement = new StringElement(element.getBaseForm()); realisedElement.setFeature(InternalFeature.DISCOURSE_FUNCTION, element.getFeature(InternalFeature.DISCOURSE_FUNCTION)); } else { NLGElement baseWord = element.getFeatureAsElement(InternalFeature.BASE_WORD); if(baseWord == null && this.lexicon != null) { baseWord = this.lexicon.lookupWord(element.getBaseForm()); } ElementCategory category = element.getCategory(); if(category instanceof LexicalCategory) { switch((LexicalCategory) category){ case PRONOUN: realisedElement = MorphologyRules.doPronounMorphology(element); break; case NOUN: realisedElement = MorphologyRules.doNounMorphology(element, (WordElement) baseWord); break; case VERB: realisedElement = MorphologyRules.doVerbMorphology(element, (WordElement) baseWord); break; case ADJECTIVE: realisedElement = MorphologyRules.doAdjectiveMorphology(element, (WordElement) baseWord); break; case ADVERB: realisedElement = MorphologyRules.doAdverbMorphology(element, (WordElement) baseWord); break; default: realisedElement = new StringElement(element.getBaseForm()); realisedElement.setFeature(InternalFeature.DISCOURSE_FUNCTION, element.getFeature(InternalFeature.DISCOURSE_FUNCTION)); } } } return realisedElement; } @Override public List realise(List elements) { List realisedElements = new ArrayList(); NLGElement currentElement = null; NLGElement determiner = null; NLGElement prevElement = null; if(elements != null) { for(NLGElement eachElement : elements) { currentElement = realise(eachElement); if(currentElement != null) { //pass the discourse function and appositive features -- important for orth processor currentElement.setFeature(Feature.APPOSITIVE, eachElement.getFeature(Feature.APPOSITIVE)); Object function = eachElement.getFeature(InternalFeature.DISCOURSE_FUNCTION); if(function != null) { currentElement.setFeature(InternalFeature.DISCOURSE_FUNCTION, function); } if(prevElement != null && prevElement instanceof StringElement && eachElement instanceof InflectedWordElement && ((InflectedWordElement) eachElement).getCategory().equals(LexicalCategory.NOUN)) { String prevString = prevElement.getRealisation(); //realisedElements.get(realisedElements.size() - 1) prevElement.setRealisation(DeterminerAgrHelper.checkEndsWithIndefiniteArticle(prevString, currentElement.getRealisation())); } // realisedElements.add(realise(currentElement)); realisedElements.add(currentElement); if(determiner == null && DiscourseFunction.SPECIFIER.equals(currentElement.getFeature( InternalFeature.DISCOURSE_FUNCTION))) { determiner = currentElement; determiner.setFeature(Feature.NUMBER, eachElement.getFeature(Feature.NUMBER)); // MorphologyRules.doDeterminerMorphology(determiner, // currentElement.getRealisation()); } else if(determiner != null) { if(currentElement instanceof ListElement) { // list elements: ensure det matches first element NLGElement firstChild = ((ListElement) currentElement).getChildren().get(0); if(firstChild != null) { //AG: need to check if child is a coordinate if(firstChild instanceof CoordinatedPhraseElement) { MorphologyRules.doDeterminerMorphology(determiner, firstChild.getChildren().get(0).getRealisation()); } else { MorphologyRules.doDeterminerMorphology(determiner, firstChild.getRealisation()); } } } else { // everything else: ensure det matches realisation MorphologyRules.doDeterminerMorphology(determiner, currentElement.getRealisation()); } determiner = null; } } prevElement = eachElement; } } return realisedElements; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy