Searching for a string in a very efficient way

9 次查看（过去 30 天）
gwar
gwar 2013-7-17
Hi.
I have two cell arrays, A and B. A contains 3000 strings and B contains 107,000 strings. Some of the strings in B might also be present in A. Each of these strings is a 7 letter word. I need to find which strings in B are also present in A. I did this by writing the following:
[~,p] = ismember(A, B);
p(p==0) = []; % removing zeros from the p array
I then use the indices in p to get the strings in B that are also in A. This works but takes a long time to compute (0.4 sec). Since I need to do this step about 30 times (for other A and B), the overall time becomes large. Does anyone have an idea of how to make this string search faster. With thanks in advance, G

请先登录，再回答此问题。

采纳的回答

Azzi Abdelmalek
Azzi Abdelmalek 2013-7-17
编辑：Azzi Abdelmalek 2013-7-17
Instead of ismember(B, A), You should use
ismember(A,B);
  1 个评论
gwar
gwar 2013-7-17
In my case ismember(A,B) or ismember(B,A) have very similar computation times. I have edited my question since I mixed up the A and B.

请先登录，再进行评论。

更多回答（1 个）

Jan
Jan 2013-7-17
ismember sorts the input strings to allow for an efficient binary search. If you call this 30 times, sorting the larger cell string explicitly will save 29 sorting procedures.
  1 个评论
gwar
gwar 2013-7-17
You mean combining all the 30 A´s and 30 B´s and calling ismember only once on the combined cell array?

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Shifting and Sorting Matrices 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by