Texts Pre-processing & String Matching Quiz

What is the process of stripping off affixes to find basic morphological structure or reducing a word to its stem or root or base form?

• Edit Distance

• Segmentation

• Lemmatization

• Stemming

Which term designates the part of a word that remains when all affixes have been removed and is not further analyzable?

• Root

• Stem

• Base

• Affix

Which algorithm is a simple and efficient algorithm for stemming or stripping off affixes without the need for a dictionary?

• Smith-Waterman Algorithm

• Levenshtein Algorithm

• Dynamic Programming Algorithm

• Porter Algorithm

What is the canonical or dictionary form of a set of related words called?

• Root

• Lemma

• Base

• Stem

What is the process of segmenting/tokenizing text into words?

• Segmentation

• Lemmatization

• Stemming

• Edit Distance

Which algorithm is used to measure the distance between two strings by finding the minimum number of editing operations needed to transform one string into another?

• Greedy Algorithm

• Dynamic Programming Algorithm

• Smith-Waterman Algorithm

• Levenshtein Algorithm

What is the distance between two strings that is a measure of how alike two strings are to each other?

• Alignment Distance

• Edit Distance

• String Distance

• Spelling Distance

Which type of error detection involves spelling errors resulting in non-words?

• Non-word error detection

• Isolated word error detection

• Context-dependent error correction

• Spelling Error Correction

What is the crucial step in text processing that involves segmenting/tokenizing text into individual sentences?

• Word Segmentation

• Sentence Segmentation

• String Matching

• Edit Distance

Which algorithm is commonly used to segment Chinese words with the help of a list of dictionary containing all possible Chinese words?

• Levenshtein Algorithm

• Smith-Waterman Algorithm

• Maximum Matching Algorithm

• Dynamic Programming Algorithm