AUL-Legazpi

UGResearch

Enstoval mobile app

Chunking Algorithm

  • Step 1: Get the longest database number with length not exceeding the unmatched numbers of the input.

  • Step 2: Compare each unmatched input numbers from left to right with the current database number.

  • Step 3: If matched, replace it with the meaning of the current database number.

  • Step 4: While not all input numbers are matched or database is not yet exhausted, repeat all starting from Step 1

FLC/CAW Algorithm

  • Step 1: Get the first letters of the input.

  • Step 2: Convert the first letters into AFC (alpha frequency code).

  • Step 3: Get the longest database AFC with numbers not exceeding that of input AFC.

  • Step 4: If database AFC is not more than input AFC, subtract database AFC from input AFC. Print the word of the database AFC.

  • Step 5: While input AFC is not yet all zeros or database is not yet exhausted, repeat from Step 2.

For complete information click here

Posted on: 02.18.2017