Info

此问题已关闭。 请重新打开它进行编辑或回答。

Same error in stemming

1 次查看（过去 30 天）
prabi p
prabi p 2016-4-22
关闭： MATLAB Answer Bot 2021-8-20
error:
Undefined function 'eq' for input arguments of type 'cell'.
Error in simple>step1ab (line 273) if b(k) == 's'
Error in simple>porterdupe_pra (line 83) x = step1ab(b, k, k0);
Error in simple (line 55) stem = porterdupe_pra(out_str1);
Error in find_stems (line 2) t = simple(); -----------------------------------------------
code:
function var = simple %function [out_str1] = simple() %function t = simple();
stopwords_cellstring={'a', 'about', 'above', 'above', 'across', 'after', ... 'afterwards', 'again', 'against', 'all', 'almost', 'alone', 'along', ... 'already', 'also','although','always','am','among', 'amongst', 'amoungst', ... 'amount', 'an', 'and', 'I', 'We', 'another', 'Another', 'The', 'any','anyhow','anyone','anything','anyway', ... 'anywhere', 'are', 'around', 'as', 'at', 'it.', 'back','be','became', 'because','become',... 'becomes', 'becoming', 'been', 'before',... 'beforehand', 'behind', 'being', 'below',... 'beside', 'besides', 'between', 'beyond', 'bill', 'both', 'bottom','but', 'by',... 'call', 'can', 'cannot', 'cant', 'co', 'con', 'could', 'couldnt', 'cry', 'de',... 'describe', 'detail', 'do', 'done', 'down', 'due', 'during', 'each', 'eg', 'eight',... 'either', 'eleven','else', 'elsewhere', 'empty', 'enough', 'etc', 'even', 'ever', ... 'every', 'everyone', 'everything', 'everywhere', 'except', 'few', 'fifteen', 'fify',... 'fill', 'find', 'fire', 'first', 'five', 'for', 'former', 'formerly', 'forty', 'found',... 'four', 'from', 'front', 'full', 'further', 'get', 'give', 'go', 'had', 'has', 'hasnt',... 'have', 'he', 'hence', 'her', 'here', 'hereafter', 'hereby', 'herein', 'hereupon', ... 'hers', 'herself', 'him', 'himself', 'his', 'how', 'however', 'hundred', 'ie', 'if',... 'in', 'inc', 'indeed', 'interest', 'into', 'is', 'it', 'its', 'itself', 'keep', 'last',... 'latter', 'latterly', 'least', 'less', 'ltd', 'made', 'many', 'may', 'me', 'meanwhile',... 'might', 'mill', 'mine', 'more', 'moreover', 'most', 'mostly', 'move', 'much', 'must',... 'my', 'myself', 'name', 'namely', 'neither', 'never', 'nevertheless', 'next', 'nine',... 'no', 'nobody', 'none', 'noone', 'nor', 'not', 'nothing', 'now', 'nowhere', 'of', 'off',... 'often', 'on', 'once', 'one', 'only', 'onto', 'or', 'other', 'others', 'otherwise',... 'our', 'ours', 'ourselves', 'out', 'over', 'own','part', 'per', 'perhaps', 'please',... 'put', 'rather', 're', 'same', 'see', 'seem', 'seemed', 'seeming', 'seems', 'serious',... 'several', 'she', 'should', 'show', 'side', 'since', 'sincere', 'six', 'sixty', 'so',... 'some', 'somehow', 'someone', 'something', 'sometime', 'sometimes', 'somewhere', ... 'still', 'such', 'system', 'take', 'ten', 'than', 'that', 'the', 'their', 'them',... 'themselves', 'then', 'thence', 'there', 'thereafter', 'thereby', 'therefore', ... 'therein', 'thereupon', 'these', 'they', 'thickv', 'thin', 'third', 'this', 'those',... 'though', 'three', 'through', 'throughout', 'thru', 'thus', 'to', 'together', 'too',... 'top', 'toward', 'towards', 'twelve', 'twenty', 'two', 'un', 'under', 'until', 'up',... 'upon', 'us', 'very', 'via', 'was', 'we', 'well', 'were', 'what', 'whatever', 'when',... 'whence', 'whenever', 'where', 'whereafter', 'whereas', 'whereby', 'wherein',... 'whereupon', 'wherever', 'whether', 'which', 'while', 'whither', 'who', 'whoever',... 'whole', 'whom', 'whose', 'why', 'will', 'with', 'within', 'without', 'would', 'yet',... 'you', 'your', 'yours', 'yourself', 'yourselves', 'the'};
fid = fileread('E:\MINI PROJECT\PRO\reviews1.txt'); %out_str = {}; %split1 = {}; %celldisp(C); %CStr = textscan(fid, '%s', 'delimiter', '\n'); %disp(C); %disp('yyttttttt');
split1 = regexp(fid,'\s','split');
%split1 = regexp(str1,'\s','split');
out_str1 = split1(~ismember(split1,stopwords_cellstring));
stem = porterdupe_pra(out_str1);
%out_str1 = split1(~ismember(split1,stopwords_cellstring));
%results = cellfun(@porterdupe, out_str1, 'UniformOutput', false);
%try
%Poter_result = porterdupe_pra{out_str1}; %catch %rethrow(err); %end %end end function [stem] = porterdupe_pra(out_str1) global j;
b = out_str1; disp(b) disp('hello') k = length(b); k0 = 1; j = k; % With this if statement, strings of length 1 or 2 don't go through the % stemming process. Remove this conditional to match the published % algorithm. stem = b; if k > 2 disp('inside if') % Output displays per step are commented out. %disp(sprintf('Word to stem: %s', b)); x = step1ab(b, k, k0); %disp(sprintf('Steps 1A and B yield: %s', x{1})); x = step1c(x{1}, x{2}, k0); %disp(sprintf('Step 1C yields: %s', x{1})); x = step2(x{1}, x{2}, k0); %disp(sprintf('Step 2 yields: %s', x{1})); x = step3(x{1}, x{2}, k0); %disp(sprintf('Step 3 yields: %s', x{1})); x = step4(x{1}, x{2}, k0); %disp(sprintf('Step 4 yields: %s', x{1})); x = step5(x{1}, x{2}, k0); %disp(sprintf('Step 5 yields: %s', x{1})); stem = x{1}; end end
% cons(j) is TRUE = b[j] is a consonant.
function c = cons(i, b, k0) c = true; switch(b(i)) case {'a', 'e', 'i', 'o', 'u'} c = false; case 'y' if i == k0 c = true; else c = ~cons(i - 1, b, k0); end end end
% mseq() measures the number of consonant sequences between k0 and j. If % c is a consonant sequence and v a vowel sequence, and .. indicates % arbitrary presence,
% c<v> gives 0 % c>vc<v gives 1 % c>vcvc<v gives 2 % c>vcvcvc<v gives 3 % .... function n = measure(b, k0) global j; n = 0; i = k0; while true if i > j return end if ~cons(i, b, k0) break; end i = i + 1; end i = i + 1; while true while true if i > j return end if cons(i, b, k0) break; end i = i + 1; end i = i + 1; n = n + 1; while true if i > j return end if ~cons(i, b, k0) break; end i = i + 1; end i = i + 1; end end
% vowelinstem() is TRUE = k0,...j contains a vowel function vis = vowelinstem(b, k0) global j; for i = k0:j, if ~cons(i, b, k0) vis = true; return end end vis = false; end
%doublec(i) is TRUE = i,(i-1) contain a double consonant. function dc = doublec(i, b, k0) if i < k0+1 dc = false; return end if b(i) ~= b(i-1) dc = false; return end dc = cons(i, b, k0); end
% cvc(j) is TRUE = j-2,j-1,j has the form consonant - vowel - consonant % and also if the second c is not w,x or y. this is used when trying to % restore an e at the end of a short word. e.g. % % cav(e), lov(e), hop(e), crim(e), but % snow, box, tray.
function c1 = cvc(i, b, k0) if ((i < (k0+2)) ~cons(i, b, k0) cons(i-1, b, k0) ~cons(i-2, b, k0)) c1 = false; else if (b(i) == 'w' b(i) == 'x' b(i) == 'y') c1 = false; return end c1 = true; end end
% ends(s) is TRUE = k0,...k ends with the string s. function s = ends(str, b, k) global j; if (str(length(str)) ~= b(k)) s = false; return end % tiny speed-up if (length(str) > k) s = false; return end if strcmp(b(k-length(str)+1:k), str) s = true; j = k - length(str); return else s = false; end end
% setto(s) sets (j+1),...k to the characters in the string s, readjusting % k accordingly.
function so = setto(s, b, k) global j; for i = j+1:(j+length(s)) b(i) = s(i-j); end if k > j+length(s) b((j+length(s)+1):k) = ''; end k = length(b); so = {b, k}; end % rs(s) is used further down. % [Note: possible null/value for r if rs is called] function r = rs(str, b, k, k0) r = {b, k}; if measure(b, k0) > 0 r = setto(str, b, k); end end
% step1ab() gets rid of plurals and -ed or -ing. e.g.
% caresses -> caress % ponies -> poni % ties -> ti % caress -> caress % cats -> cat
% feed -> feed % agreed -> agree % disabled -> disable
% matting -> mat % mating -> mate % meeting -> meet % milling -> mill % messing -> mess
% meetings -> meet
function s1ab = step1ab(b, k, k0) global j; disp(b) if b(k) == 's' disp('slab inside') if ends('sses', b, k) k = k-2; elseif ends('ies', b, k) retVal = setto('i', b, k); b = retVal{1}; k = retVal{2}; elseif (b(k-1) ~= 's') k = k-1; end end if ends('eed', b, k) if measure(b, k0) > 0; k = k-1; end elseif (ends('ed', b, k) ends('ing', b, k)) && vowelinstem(b, k0) k = j; retVal = {b, k}; if ends('at', b, k) retVal = setto('ate', b(k0:k), k); elseif ends('bl', b, k) retVal = setto('ble', b(k0:k), k); elseif ends('iz', b, k) retVal = setto('ize', b(k0:k), k); elseif doublec(k, b, k0) retVal = {b, k-1}; if b(retVal{2}) == 'l' b(retVal{2}) == 's' ... b(retVal{2}) == 'z' retVal = {retVal{1}, retVal{2}+1}; end elseif measure(b, k0) == 1 && cvc(k, b, k0) retVal = setto('e', b(k0:k), k); end k = retVal{2}; b = retVal{1}(k0:k); end j = k; s1ab = {b(k0:k), k}; end
% step1c() turns terminal y to i when there is another vowel in the stem. function s1c = step1c(b, k, k0) global j; if ends('y', b, k) && vowelinstem(b, k0) b(k) = 'i'; end j = k; s1c = {b, k}; end % step2() maps double suffices to single ones. so -ization ( = -ize plus % -ation) maps to -ize etc. note that the string before the suffix must give % m() > 0. function s2 = step2(b, k, k0) global j; s2 = {b, k}; switch b(k-1) case {'a'} if ends('ational', b, k) s2 = rs('ate', b, k, k0); elseif ends('tional', b, k) s2 = rs('tion', b, k, k0); end; case {'c'} if ends('enci', b, k) s2 = rs('ence', b, k, k0); elseif ends('anci', b, k) s2 = rs('ance', b, k, k0); end; case {'e'} if ends('izer', b, k) s2 = rs('ize', b, k, k0); end; case {'l'} if ends('bli', b, k) s2 = rs('ble', b, k, k0); elseif ends('alli', b, k) s2 = rs('al', b, k, k0); elseif ends('entli', b, k) s2 = rs('ent', b, k, k0); elseif ends('eli', b, k) s2 = rs('e', b, k, k0); elseif ends('ousli', b, k) s2 = rs('ous', b, k, k0); end; case {'o'} if ends('ization', b, k) s2 = rs('ize', b, k, k0); elseif ends('ation', b, k) s2 = rs('ate', b, k, k0); elseif ends('ator', b, k) s2 = rs('ate', b, k, k0); end; case {'s'} if ends('alism', b, k) s2 = rs('al', b, k, k0); elseif ends('iveness', b, k) s2 = rs('ive', b, k, k0); elseif ends('fulness', b, k) s2 = rs('ful', b, k, k0); elseif ends('ousness', b, k) s2 = rs('ous', b, k, k0); end; case {'t'} if ends('aliti', b, k) s2 = rs('al', b, k, k0); elseif ends('iviti', b, k) s2 = rs('ive', b, k, k0); elseif ends('biliti', b, k) s2 = rs('ble', b, k, k0); end; case {'g'} if ends('logi', b, k) s2 = rs('log', b, k, k0); end; end j = s2{2}; end
% step3() deals with -ic-, -full, -ness etc. similar strategy to step2. function s3 = step3(b, k, k0) global j; s3 = {b, k}; switch b(k) case {'e'} if ends('icate', b, k) s3 = rs('ic', b, k, k0); elseif ends('ative', b, k) s3 = rs('', b, k, k0); elseif ends('alize', b, k) s3 = rs('al', b, k, k0); end; case {'i'} if ends('iciti', b, k) s3 = rs('ic', b, k, k0); end; case {'l'} if ends('ical', b, k) s3 = rs('ic', b, k, k0); elseif ends('ful', b, k) s3 = rs('', b, k, k0); end; case {'s'} if ends('ness', b, k) s3 = rs('', b, k, k0); end; end j = s3{2}; end % step4() takes off -ant, -ence etc., in context c>vcvc<v. function s4 = step4(b, k, k0) global j; switch b(k-1) case {'a'} if ends('al', b, k) end; case {'c'} if ends('ance', b, k) elseif ends('ence', b, k) end; case {'e'} if ends('er', b, k) end; case {'i'} if ends('ic', b, k) end; case {'l'} if ends('able', b, k) elseif ends('ible', b, k) end; case {'n'} if ends('ant', b, k) elseif ends('ement', b, k) elseif ends('ment', b, k) elseif ends('ent', b, k) end; case {'o'} if ends('ion', b, k) if j == 0 elseif ~(strcmp(b(j),'s') strcmp(b(j),'t')) j = k; end elseif ends('ou', b, k) end; case {'s'} if ends('ism', b, k) end; case {'t'} if ends('ate', b, k) elseif ends('iti', b, k) end; case {'u'} if ends('ous', b, k) end; case {'v'} if ends('ive', b, k) end; case {'z'} if ends('ize', b, k) end; end if measure(b, k0) > 1 s4 = {b(k0:j), j}; else s4 = {b(k0:k), k}; end end
% step5() removes a final -e if m() > 1, and changes -ll to -l if m() > 1. function s5 = step5(b, k, k0) global j; j = k; if b(k) == 'e' a = measure(b, k0); if (a > 1) ((a == 1) && ~cvc(k-1, b, k0)) k = k-1; end end if (b(k) == 'l') && doublec(k, b, k0) && (measure(b, k0) > 1) k = k-1; end s5 = {b(k0:k), k}; end

此问题已关闭。

回答（1 个）

Azzi Abdelmalek
Azzi Abdelmalek 2016-4-22
If b is a cell array Use
if b{k}=='s'
or
if ismember(b(k),'s')

此问题已关闭。

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by